package ink.lovejinhu.leetcode;

/**
 * @author jinhu
 * created 2021-04-29 7:15
 */
public class Solution_0028 {
    /**
     * KMP
     * @param haystack
     * @param needle
     * @return
     */
    public int strStr(String haystack, String needle) {
        char[] parent = haystack.toCharArray();  //父
        char[] child = haystack.toCharArray();   //子
        int childLength = child.length;
        int parentLength = parent.length;
        int start = 0;
        for (int i = 0; i < parent.length; ) {
                
        }
        return 0;
    }
}
